A # P-COMPLETE PROBLEM OVER ARITHMETICAL TREESMAURI G; SABADINI N.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 112; PP. 308-315; BIBL. 12 REF.Conference Paper

EQUIVALENCE AND MEMBERSHIP PROBLEMS FOR REGULAR TRACE LANGUAGESBERTONI A; MAURI G; SABADINI N et al.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 61-71; BIBL. 11 REF.Conference Paper

A HIERARCHY OF REGULAR TRACE LANGUAGES AND SOME COMBINATORIAL APPLICATIONSBERTONI A; MAURI G; SABADINI N et al.1982; WORLD CONFERENCE ON MATHEMATICS AT THE SERVICE OF MAN. 2/1982-06-28/LAS PALMAS; ESP; DA. 1982; PP. 146-153; BIBL. 10 REF.Conference Paper

A CHARACTERIZATION OF THE CLASS OF FUNCTIONS COMPUTABLE IN POLYNOMIAL TIME ON RANDOM ACCESS MACHINESBERTONI A; MAURI G; SABADINI N et al.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK; ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 168-176; BIBL. 17 REF.Conference Paper

AN APPLICATION OF THE THEORY OF FREE PARTIALLY COMMUTATIVE MONOIDS: ASYMPTOTIC DENSITIES OF TRACE LANGUAGESBERTONI A; BRAMBILLA M; MAURI G et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 205-215; BIBL. 13 REF.Conference Paper

Non deterministic machines and their generalizationsBERTONI, A; MAURI, G; SABADINI, N et al.Lecture notes in physics. 1983, Num 196, pp 86-97, issn 0075-8450Article

The complexity of computing the number of strings of given length in context-free languagesBERTONI, A; GOLDWURM, M; SABADINI, N et al.Theoretical computer science. 1991, Vol 86, Num 2, pp 325-342, issn 0304-3975Article

On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languagesBRUSCHI, D; PIGHIZZINI, G; SABADINI, N et al.Information and computation (Print). 1994, Vol 108, Num 2, pp 262-285, issn 0890-5401Article

On the class NL with oracleBERTONI, A; MAURI, G; SABADINI, N et al.Computers and artificial intelligence. 1987, Vol 6, Num 5, pp 411-420, issn 0232-0274Article

Membership problems for regular and context-free trace languagesBERTONI, A; MAURI, G; SABADINI, N et al.Information and computation (Print). 1989, Vol 82, Num 2, pp 135-150, issn 0890-5401Article

Representing Place/Transition nets in Span(Graph)KATIS, P; SABADINI, N; WALTERS, R. F. C et al.Lecture notes in computer science. 1997, pp 322-336, issn 0302-9743, isbn 3-540-63888-1Conference Paper

Span(Graph): A categorical algebra of transition systemsKATIS, P; SABADINI, N; WALTERS, R. F. C et al.Lecture notes in computer science. 1997, pp 307-321, issn 0302-9743, isbn 3-540-63888-1Conference Paper

A formalization of the IWIM modelKATIS, P; SABADINI, N; WALTERS, R. F. C et al.Lecture notes in computer science. 2000, pp 267-283, issn 0302-9743, isbn 3-540-41020-1Conference Paper

THE COMPOSITIONAL CONSTRUCTION OF MARKOV PROCESSES IIDE FRANCESCO ALBASINI, L; SABADINI, N; WALTERS, R. F. C et al.Informatique théorique et applications (Imprimé). 2011, Vol 45, Num 1, pp 117-142, issn 0988-3754, 26 p.Conference Paper